Quantum Multiple-Valued Decision Diagrams Containing Skipped Variables
نویسندگان
چکیده
Quantum multiple-valued decision diagrams (QMDD) are data structures that enable efficient representation and manipulation of unitary matrices representing reversible and quantum circuits. QMDDs are of the form of a rooted, directed, acyclic graph with initial and terminal vertices where each vertex is annotated with a variable name representing a circuit line. Directed paths from the intial to a terminal vertex can be represented as a sequence of variable names in the order in which they appear in the path. The existence of QMDD paths that do not contain all variable names, or “skipped variables”, has direct ramifications in the formulation of synthesis and other algorithms for reversible and quantum logic. Skipped variables are generally rare and tend to appear in quantum circuits that are intended to operate using superimposed values on the control lines. We have found that a unitary matrix representing a circuit whose QMDD contains skipped variables is likely to exhibit a specific anomaly when decomposed into a cascade of unitary matrices using the Reck-Zeilinger-BernsteinBertani algorithm.
منابع مشابه
Minimization of Quantum Multiple-valued Decision Diagrams Using Data Structure Metrics
This paper describes new metrics for size minimization of the data structure referred to as quantum multiple-valued decision diagrams (QMDD). QMDD are used to represent the matrices describing reversible and quantum gates and circuits. We explore metrics related to the frequency of edges with non-zero weight for the entire QMDD data structure and their histograms with respect to each variable. ...
متن کاملA Method to Represent Multiple-Output Switching Functions by Using Multi-Valued Decision Diagrams
Multiple-output switching functions can be simulated by multiple-valued decision diagrams (MDDs) at a signi cant reduction in computation time. We analyze the following approaches to the representation problem: shared multiple-valued decision diagrams (SMDDs), multi-terminal multiple-valued decision diagrams (MTMDDs), and shared multi-terminal multiple-valued decision diagrams (SMTMDDs). For ex...
متن کاملPlanar Multiple-Valued Decision Diagrams
In VLSI, crossings occupy space and cause delay. Therefore, there is significant benefit to planar circuits. We propose the use of planar multiple-valued decision diagrams to produce planar multiple-valued circuits. Specifically, we show conditions on 1) threshold functions, 2 symmetric functions, and 3) monodiagrams. Our results apply to binary functions, as well. For example, we show that all...
متن کاملMod-p Decision Diagrams: A Data Structure for Multiple-Valued Functions
Multiple-valued decision diagrams (MDDs) give a way of approaching problems by using symbolic variables which are often more naturally associated with the problem statement than the variables obtained by a binary encoding. We present a more general class of MDDs, containing not only branching nodes but also functional nodes, labeled by addition modulo p operation, p prime, and give algorithms f...
متن کاملHeuristics to Minimize Multiple-Valued Decision Diagrams
In this paper, we propose a method to minimize multiple-valued decision diagrams (MDDs) for multipleoutput functions. We consider the following: (1) a heuristic for encoding the 2-valued inputs; and (2) a heuristic for ordering the multiple-valued input variables based on sampling, where each sample is a group of outputs. We first generate a 4-valued input 2-valued multiple-output function from...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Multiple-Valued Logic and Soft Computing
دوره 24 شماره
صفحات -
تاریخ انتشار 2015